Constrained Query Answering

Traditional answering methods evaluate queries only against positive and definite knowledge expressed by means of facts and deduction rules. They do not make use of negative, disjunctive or existential information. Negative or indefinite knowledge is however often available in knowledge base systems, either as design requirements, or as observed properties. Such knowledge can serve to rule out unproductive subexpressions during query answering. In this article, we propose an approach for constraining any conventional query answering procedure with general, possibly negative or indefinite formulas, so as to discard impossible cases and to avoid redundant evaluations. This approach does not impose additional conditions on the positive and definite knowledge, nor does it assume any particular semantics for negation. It adopts that of the conventional query answering procedure it constrains. This is achieved by relying on meta-interpretation for specifying the constraining process. The soundness, completeness, and termination of the underlying query answering procedure are not compromised. Constrained query answering can be applied for answering queries more efficiently as well as for generating more informative, intensional answers

Argumentation schemes for collaborative planning

Postprin

Regression in Modal Logic

In this work we propose an encoding of Reiter’s Situation Calculus solution to the frame problem into the framework of a simple multimodal logic of actions. In particular we present the modal counterpart of the regression technique. This gives us a theorem proving method for a relevant fragment of our modal logic

Удвоение памяти для набора программ в ЭВМ "Проминь"

In previous work, we proposed a modal fragment of the sit-uation calculus called ES, which fully captures Reiter’s ba-sic action theories. ES also has epistemic features, includ-ing only-knowing, which refers to all that an agent knows in the sense of having a knowledge base. While our model of only-knowing has appealing properties in the static case, it appears to be problematic when actions come into play. First of all, its utility seems to be restricted to an agent’s initial knowledge base. Second, while it has been shown that only-knowing correctly captures default inferences, this was only in the static case, and undesirable properties appear to arise in the presence of actions. In this paper, we remedy both of these shortcomings and propose a new dynamic semantics of only-knowing, which is closely related to Lin and Reiter’s notion of progression when actions are performed and where defaults behave properly

Variable Nav1.5 Protein Expression from the Wild-Type Allele Correlates with the Penetrance of Cardiac Conduction Disease in the Scn5a+/− Mouse Model

BACKGROUND: Loss-of-function mutations in SCN5A, the gene encoding Na(v)1.5 Na+ channel, are associated with inherited cardiac conduction defects and Brugada syndrome, which both exhibit variable phenotypic penetrance of conduction defects. We investigated the mechanisms of this heterogeneity in a mouse model with heterozygous targeted disruption of Scn5a (Scn5a(+/-) mice) and compared our results to those obtained in patients with loss-of-function mutations in SCN5A. METHODOLOGY/PRINCIPAL FINDINGS: Based on ECG, 10-week-old Scn5a(+/-) mice were divided into 2 subgroups, one displaying severe ventricular conduction defects (QRS interval>18 ms) and one a mild phenotype (QRS53 weeks), ajmaline effect was larger in the severely affected subgroup. These data matched the clinical observations on patients with SCN5A loss-of-function mutations with either severe or mild conduction defects. Ventricular tachycardia developed in 5/10 old severely affected Scn5a(+/-) mice but not in mildly affected ones. Correspondingly, symptomatic SCN5A-mutated Brugada patients had more severe conduction defects than asymptomatic patients. Old severely affected Scn5a(+/-) mice but not mildly affected ones showed extensive cardiac fibrosis. Mildly affected Scn5a(+/-) mice had similar Na(v)1.5 mRNA but higher Na(v)1.5 protein expression, and moderately larger I(Na) current than severely affected Scn5a(+/-) mice. As a consequence, action potential upstroke velocity was more decreased in severely affected Scn5a(+/-) mice than in mildly affected ones. CONCLUSIONS: Scn5a(+/-) mice show similar phenotypic heterogeneity as SCN5A-mutated patients. In Scn5a(+/-) mice, phenotype severity correlates with wild-type Na(v)1.5 protein expression

A Genome-Wide Association Study Identifies Susceptibility Variants for Type 2 Diabetes in Han Chinese

To investigate the underlying mechanisms of T2D pathogenesis, we looked for diabetes susceptibility genes that increase the risk of type 2 diabetes (T2D) in a Han Chinese population. A two-stage genome-wide association (GWA) study was conducted, in which 995 patients and 894 controls were genotyped using the Illumina HumanHap550-Duo BeadChip for the first genome scan stage. This was further replicated in 1,803 patients and 1,473 controls in stage 2. We found two loci not previously associated with diabetes susceptibility in and around the genes protein tyrosine phosphatase receptor type D (PTPRD) (P = 8.54×10−10; odds ratio [OR] = 1.57; 95% confidence interval [CI] = 1.36–1.82), and serine racemase (SRR) (P = 3.06×10−9; OR = 1.28; 95% CI = 1.18–1.39). We also confirmed that variants in KCNQ1 were associated with T2D risk, with the strongest signal at rs2237895 (P = 9.65×10−10; OR = 1.29, 95% CI = 1.19–1.40). By identifying two novel genetic susceptibility loci in a Han Chinese population and confirming the involvement of KCNQ1, which was previously reported to be associated with T2D in Japanese and European descent populations, our results may lead to a better understanding of differences in the molecular pathogenesis of T2D among various populations

An argumentation-based approach for reasoning about trust in information sources

International audienceDuring a dialogue, agents exchange information with each other and need thus to deal with incoming information. For that purpose, they should be able to reason effectively about trustworthiness of information sources. This paper proposes an argument-based system that allows an agent to reason about its own beliefs and information received from other sources. An agent's beliefs are of two kinds: beliefs about the environment (like the window is closed) and beliefs about trusting sources (like agent i trusts agent j). Six basic forms of trust are discussed in the paper including the most common one on sincerity. Starting with a base which contains such information, the system builds two types of arguments: arguments in favour of trusting a given source of information and arguments in favour of believing statements which may be received from other agents. We discuss how the different arguments interact and how an agent may decide to trust another source and thus to accept information coming from that source. The system is then extended in order to deal with graded trust (like agent i trusts to some extent agent j)